FPPR: fast pessimistic (dynamic) PageRank to update PageRank in evolving directed graphs on network changes

The paper presents a new algorithm FPPR which updates PageRanks of directed network after topological changes in the graphs. is capable regenerating scores on node and link addition/deletion. expected value random surfers are used for updating newly added nodes as well impacted chain where nodes/links or removed. complexity k addition $$\mathcal {O}(k\times d^{(k)}_{avg})$$ $$d^{(k)}_{avg}$$ average degree added. On other hand deletion, {O}(|V_s|+|E_s|)$$ $$V_s$$ $$E_s$$ set edges updated using Selective Breath First Update. Extensive experiments have been performed different synthetic real-world networks. experimental result shows that rank generated by proposed method highly correlated with recalculation benchmark Power Iteration algorithm.